1 1 Ju n 20 13 SINGULARITIES IN THE ENTROPY OF ASYMPTOTICALLY LARGE SIMPLE GRAPHS
نویسنده
چکیده
We prove that the asymptotic entropy of large simple graphs, as a function of fixed edge and triangle densities, is nondifferentiable along a certain curve.
منابع مشابه
Singularities in the Entropy of Asymptotically Large Simple Graphs
We prove that the asymptotic entropy of large simple graphs, as a function of fixed edge and triangle densities, is nondifferentiable along a certain curve.
متن کامل60 v 1 1 6 Ju n 20 00 Blow - up for solutions of hyperbolic PDE and spacetime singularities
An important question in mathematical relativity theory is that of the nature of spacetime singularities. The equations of general relativity, the Einstein equations, are essentially hyperbolic in nature and the study of spacetime singularities is naturally related to blow-up phenomena for nonlinear hyperbolic systems. These connections are explained and recent progress in applying the theory o...
متن کامل06 13 1 v 1 1 6 Ju n 20 00 Black Hole Entropy in 1 + 1 Dimensions from a Quasi - Chern Simons term
We introduce a ’quasi-topological‘ term [1] in D = 1 + 1 dimensions and the entropy for black holes is calculated [2]. The source of entropy in this case is justified by a non-null stress-energy tensor.
متن کاملسیاهچالههای نظریه گوس- بونه در حضور شاره کامل
In this paper, the solutions of the Gauss-Bonnet theory of gravity was proposed in the presence of a perfect fluid with thermodynamic pressure P and energy gravity ρ in n-dimension. Accordingly, perfect fluid tensor was regarded as energy-momentum tensor and the static and radiating solutions for the linear equation of state p = wρ was calculated. This solution contains all the solutions alread...
متن کاملFast Algorithm for Optimal Compression of Graphs
We consider the problem of finding optimal description for general unlabeled graphs. Given a probability distribution on labeled graphs, we introduced in [4] a structural entropy as a lower bound for the lossless compression of such graphs. Specifically, we proved that the structural entropy for the Erdős–Rényi random graph, in which edges are added with probability p, is ` n 2 ́ h(p)−n log n+O(...
متن کامل